/*
    Copyright 2009 Spencer B. Koehler, Ph.D.

    This file is part of the Brillig Toolkit.

    The Brillig Toolkit is free software: you can redistribute it and/or modify
    it under the terms of the GNU Lesser General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    The Brillig Toolkit is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU Lesser General Public License for more details.

    You should have received a copy of the GNU Lesser General Public License
    along with The Brillig Toolkit.  If not, see <http://www.gnu.org/licenses/>.
*/
package org.brillig.nlp;


import org.brillig.fsm.Token;
import org.brillig.fsm.impl.AbstractStateDecoder;

/**
 * Decoder to build a parse tree from a state.
 * <p>
 * @author Spence Koehler
 */
public class ParseStateDecoder extends AbstractStateDecoder {
  
  private static final ParseStateDecoder INSTANCE = new ParseStateDecoder();

  public static final ParseStateDecoder getInstance() {
    return INSTANCE;
  }

  private ParseStateDecoder() {
  }

  protected Token getLeaf(Token leafToken) {
    final LexicalToken lexicalToken = (LexicalToken)leafToken;
//    return new StringToken("'" + lexicalToken.getLexicalEntry().getString() + "'");
    return leafToken;
  }
}
